Abstract Graph Machine
نویسندگان
چکیده
Graph Machine Thejaka Amila Kanewala Marcin Zalewski Andrew Lumsdaine Center for Research in Extreme Scale Technologies (CREST) Indiana University, IN, USA {thejkane,zalewski,lums}@indiana.edu
منابع مشابه
The York Abstract Machine
We introduce the York Abstract Machine (YAM) for implementing the graph programming language GP and, potentially, other graph transformation languages. The advantages of an abstract machine over a direct interpreter for graph transformation rules are better efficiency, use as a common target for compiling both future versions of GP and other languages, and portability of GP programs to differen...
متن کاملA Chemical Abstract Machine for Graph Reduction
Graph reduction is an implementation technique for the lazy λ-calculus. It has been used to implement many non-strict functional languages, such as lazy ML, Gofer and Miranda. Parallel graph reduction allows for concurrent evaluation. In this paper, we present parallel graph reduction as a Chemical Abstract Machine, and show that the resulting testing semantics is adequate wrt testing equivalen...
متن کاملModeling UML2 activity diagram by using Graph Transformation Systems and Abstract State Machine
Graphs and diagrams provide a simple and powerful approach variety of problems that are typical to computer science, for example for activities. In software development visual notation are used for modeling that including activity diagram, class diagram, control flow, graphs and some another diagrams. Models based on these notation can be seen a graph and graph transformation are involved. So A...
متن کاملThe Dynamic Geometry of Interaction Machine: A Call-by-Need Graph Rewriter
Girard’s Geometry of Interaction (GoI), a semantics designed for linear logic proofs, has been also successfully applied to programming languages. One way is to use abstract machines that pass a token in a fixed graph, along a path indicated by the GoI. These token-passing abstract machines are space efficient, because they handle duplicated computation by repeating the same moves of a token on...
متن کاملParallel Graph Reduction with the h ; Gi - machine
We have implemented a parallel graph reducer on a commercially available shared memory multiprocessor (a Sequent Symmetry TM ), that achieves real speedup compared to a a fast compiled implementation of the conventional Gmachine. Using 15 processors, this speedup ranges between 5 and 11, depending on the program. Underlying the implementation is an abstract machine called the h ; Gi-machine. We...
متن کاملThe Dynamic Geometry of Interaction Machine: A Token-Guided Graph Rewriter
In implementing evaluation strategies of the lambda-calculus, both correctness and efficiency of implementation are valid concerns. While the notion of correctness is determined by the evaluation strategy, regarding efficiency there is a larger design space that can be explored, in particular the trade-off between space versus time efficiency. We contribute to the study of this trade-off by the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1604.04772 شماره
صفحات -
تاریخ انتشار 2016